红岭矿18线南西翼通风系统技术改造

针对矿山18线南西翼矿体开采过程中存在的通风系统不完善、风量欠缺、污风无法及时排出等问题，运用风压平衡原理、网络优化技术、机站优化技术以及计算机网络模拟技术展开研究，拟定了3种可行的通风方案。经技术经济比较，确定了新掘18线905～855 m回风井（1.5 m），保留该井905 m 水平回风机站，并在855 m 水平新设1台K45 6 №12风机（18.5 kW）方案。数值模拟结果表明：18线南西翼通风系统总风量达到20.5 m3/s，井下风流的可调性和稳定性增强，为矿山的安全生产提供了有力保障。     

A new decomposition based evolutionary algorithm with uniform designs for many-objective optimization

For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence.     

Using a Discrete-Event System Specifications (DEVS) for designing a Modelica compiler

We introduce a new architecture for the design of a tool for modeling and simulation of continuous and hybrid systems. The environment includes a compiler based on Modelica, a modular and a causal standard specification language for physical systems modeling (the tool supports models composed using certain component classes defined in the Modelica Standard Library, and the instantiation, parameterization and connection of these MSL components are described using a subset of Modelica). Models are defined in Modelica and are translated into DEVS models. DEVS theory (originally defined for modeling and simulation of discrete event systems) was extended in order to permit defining these of models. The different steps in the compiling process are show, including how to model these dynamic systems under the discrete event abstraction, including examples of model simulation with their execution results.     

A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry

A steelmaking-continuous casting (SCC) scheduling problem is an example of complex hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This paper investigates the SCC scheduling problem that involves controllable processing times (CPT) with multiple objectives concerning the total waiting time, earliness/tardiness and adjusting cost. The SCC scheduling problem with CPT is seldom discussed in the existing literature. This study is motivated by the practical situation of a large integrated steel company in which the just-in-time (JIT) and cost-cutting production strategy have become a significant concern. To address this complex HFSSP, the scheduling problem is decomposed into two subproblems: a parallel machine scheduling problem (PMSP) in the last stage and an HFSSP in the upstream stages. First, a hybrid differential evolution (HDE) algorithm combined with a variable neighborhood decomposition search (VNDS) is proposed for the former subproblem. Second, an iterative backward list scheduling (IBLS) algorithm is presented to solve the latter subproblem. The effectiveness of this bi-layer optimization approach is verified by computational experiments on well-designed and real-world scheduling instances. This study provides a new perspective on modeling and solving practical SCC scheduling problems.     

Hybrid make-to-stock and make-to-order systems: a taxonomic review

Production planning and control (PPC) systems that employ aspects from both make-to-order (MTO) and make-to-stock (MTS) production control are known as hybrid MTS/MTO systems. While both MTO and MTS separately have been studied extensively, their combined use has received less attention. However, the literature on this topic is growing and this paper shows that the review performed in this paper is an important addition to the field. We categorise relevant literature according to a novel taxonomy and show that hybrid MTS/MTO production control can be used in different contexts. In addition, an overview of the modelling techniques and methods used in these papers is provided. Based on the reviewed literature, relevant research questions and directions for future research are identified. Finally, it is shown that hybrid MTS/MTO production control is prevalent in practice by discussing research with industrial applications. The paper contains an overview of research on hybrid MTS/MTO production control to be used as reference for researchers active in the field, and provides managerial insights and directions for future research on this topic.     

Global optimization for power dispatch problems based on theory of moments

Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes.     

Abrasive waterjet micro-machining of channels in metals: Comparison between machining in air and submerged in water

Abrasive water jet technology can be used for micro-milling using recently developed miniaturized nozzles. Abrasive water jet (AWJ) machining is often used with both the nozzle tip and workpiece submerged in water to reduce noise and contain debris. This paper compares the performance of submerged and unsubmerged abrasive water jet micro-milling of channels in 316L stainless steel and 6061-T6 aluminum at various nozzle angles and standoff distances. The effect of submergence on the diameter and effective footprint of AWJ erosion footprints was measured and compared. It was found that the centerline erosion rate decreased with channel depth due to the spreading of the jet as the effective standoff distance increased, and because of the growing effect of stagnation as the channel became deeper. The erosive jet spread over a larger effective footprint in air than in water, since particles on the jet periphery were slowed much more quickly in water due to increased drag. As a result, the width of a channel machined in air was wider than that in water. Moreover, it was observed that the instantaneous erosion rate decreased with channel depth, and that this decrease was a function only of the channel cross-sectional geometry, being independent of the type of metal, the jet angle, the standoff distance, and regardless of whether the jet was submerged or in air, in either the forward or backward directions. It is shown that submerged AWJM results in narrower features than those produced while machining in air, without a decrease in centerline etch rate.     

Kariya (Hildegardia barteri) seed oil extraction: comparative evaluation of solvents,modeling, and optimization techniques

In this work, the effects of solid/solvent ratio (0.10–0.25?g/ml), extraction time (3–8?h), and solvent type (n-hexane, ethyl acetate, and acetone) together with their shared interactions on Kariya seed oil (KSO) yield were investigated. The oil extraction process was modeled via response surface methodology (RSM), artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS) while the optimization of the three input variables essential to the oil extraction process was carried out by genetic algorithm (GA) and RSM methods. The low mean relative percent deviation (MRPD) of 0.94–4.69% and high coefficient of determination (R²) > 0.98 for the models developed demonstrate that they describe the solvent extraction process with high accuracy in this order: ANFIS, ANN, and RSM. The best operating condition (solid/solvent ratio of 0.1?g/ml, extraction time of 8?h, and acetone as solvent of extraction) that gave the highest KSO yield (32.52?wt.%) was obtained using GA-ANFIS and GA-ANN. Solvent extraction efficiency evaluation showed that ethyl acetate, n-hexane, and acetone gave maximum experimental oil yields of 19.20?±?0.28, 25.11?±?0.01, and 32.33?±?0.04?wt.%, respectively. Properties of the KSO varied based on the type of solvent used. The results of this work showed that KSO could function as raw material in both food and chemical industries.     

A new metaheuristic for optimization: Optics inspired optimization (OIO)

Due to the law of reflection, a concave reflecting surface/mirror causes the incident light rays to converge and a convex surface/mirror causes the light rays to reflect away so that they all appear to be diverging. These converging and diverging behaviors cause that the curved mirrors show different image types depending on the distance between the object and the mirror. We model such optical phenomena metaphorically into the searching process of numerical optimization by a new algorithm called optics inspired optimization (OIO). OIO treats the surface of the numerical function to be optimized as a reflecting surface in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each individual is assumed to be an artificial object (or light point) that its artificially glittered ray is reflected back by the function surface, given that the surface is convex or concave, and the artificial image is formed (a candidate solution is generated within the search domain) based on the mirror equations adopted from physics of optics. Besides OIO, we introduce different variants of it, called ROIO (Rotation based OIO), and COIO (Convex combination based OIO) algorithms and conduct an extensive computational effort to find out the merit of the new algorithms. Our comparisons on benchmark test functions and a real world engineering design application (i.e., optimization of a centrifuge pump) demonstrate that the new algorithms are efficient and compete better than or similar to most of state of the art optimization algorithms with the advantage of accepting few input parameters.